Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable

Parametric timing constraints are expressed naturally in timing diagram logics. Algorithmic veriication of parametrically constrained timing properties is a diicult problem, known to be undecidable in most general cases. This paper establishes that a class of parametrically constrained timing properties can be veriied algorithmically against nite-state systems; alternatively stated, containment by a regular language is shown decidable for a class of language properties (regular and non-regular) expressible in our timing diagram logic.